Managing Mismatches in Voltage Stacking with CoreUnfolding
نویسندگان
چکیده
منابع مشابه
Managing mismatches in COTS-based development
The prospect of reducing the time, cost and risk of system development has increased the interest in developing systems from COTS (Commercial-Off-The-Shelf) products. The development of complex COTS-based systems is known to be an intricate and risk prone process. There are three main reasons for this. Firstly, suppliers develop COTS products with the objective of satisfying the needs of the ma...
متن کاملManaging Photovoltaic Generation Effect On Voltage Profile Using Distributed Algorithm
In this paper, a distributed method for reactive power management in a distribution system has been presented. The proposed method focuses on the voltage rise where the distribution systems are equipped with a considerable number of photovoltaic units. This paper proposes the alternating direction method of multipliers (ADMMs) approach for solving the optimal voltage control problem in a distri...
متن کاملLanguages with mismatches
In this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r . The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden wor...
متن کاملStreaming Periodicity with Mismatches
We study the problem of finding all k-periods of a length-n string S, presented as a data stream. S is said to have k-period p if its prefix of length n− p differs from its suffix of length n− p in at most k locations. We give a one-pass streaming algorithm that computes the k-periods of a string S using poly(k, logn) bits of space, for k-periods of length at most n 2 . We also present a two-pa...
متن کاملParameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 . . . tn and pattern p = p1p2 . . . pm over respective alphabets Σt and Σp , the injection πi from Σp to Σt maximizing the number of matches between πi(p) and ti ti+1 . . . ti+m−1 (i = 1,2, . . . , n −m + 1). We examine the special case where both strings are run-length encoded, and further ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2016
ISSN: 1544-3566,1544-3973
DOI: 10.1145/2835178